Cycle covers (I) - Minimal contra pairs and Hamilton weights
نویسنده
چکیده
Article history: Received 30 April 2008 Available online 25 January 2010
منابع مشابه
Deciding Graph non-Hamiltonicity via a Closure Algorithm
We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the n! Hamilton cycles in a complete directed graph on n + 1 vertices corresponds with each of the n! n-permutation matrices P, such that pu,i = 1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n + 1. A graph instance (G) is initially coded as exclusion set ...
متن کاملOrientable Hamilton Cycle Embeddings of Complete Tripartite Graphs I: Latin Square Constructions
Abstract. In an earlier paper the authors constructed a hamilton cycle embedding of Kn,n,n in a nonorientable surface for all n ≥ 1 and then used these embeddings to determine the genus of some large families of graphs. In this two-part series, we extend those results to orientable surfaces for all n 6= 2. In part I, we explore a connection between orthogonal latin squares and embeddings. A pro...
متن کاملDeveloping a Minimal Pairs’ Package for Persian-speaking Children: A Preliminary Study
Objectives: Different treatment approaches have been introduced for children with Speech Sound Disorders (SSD). Minimal pair intervention, Metaphon therapy, and parents and children together approach as linguistically-based approaches are routinely utilized in this population and both of them shared minimal pairs as a common component. The purpose of the current study was to develop and investi...
متن کاملOn Approximating Restricted Cycle Covers
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set L. A special case of L-cycle covers are k-cycle covers for k ∈ N, where the length of each cycle must be at least k. The weight of a cycle cover of an edge-weighted graph is the sum of the weights of its edges. We com...
متن کاملSolutions of Grinberg equation and removable cycles in a cycle basis
Let G (V, E) be a simple graph with vertex set V and edge set E. A generalized cycle is a subgraph such that any vertex degree is even. A simple cycle (briefly in a cycle) is a connected subgraph such that every vertex has degree 2. A basis of the cycle space is called a cycle basis of G (V, E). A cycle basis where the sum of the weights of the cycles is minimal is called a minimum cycle basis ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 100 شماره
صفحات -
تاریخ انتشار 2010